Concurrency, Fairness and Logical Complexity

نویسنده

  • Marta Z. Kwiatkowska
چکیده

We consider a connection between fairness and 0 3 sets of functions made recently by Darondeau, Nolte, Priese and Yoccoz, and extend their work to cater for eeective asynchronous transition systems with concurrency structure represented by a Mazurkiewicz independency relation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Step-Indexed Relational Reasoning for Countable Nondeterminism

Programming languages with countable nondeterministic choice are computationally interesting since countable nondeterminism arises when modeling fairness for concurrent systems. Because countable choice introduces non-continuous behaviour, it is well-known that developing semantic models for programming languages with countable nondeterminism is challenging. We present a step-indexed logical re...

متن کامل

Model checking of mobile systems and diagnosability of weakly fair systems

This thesis consists of two independent contributions. The first deals with model checking of reference passing systems, and the second considers diagnosability under the weak fairness assumption. Reference passing systems, like mobile and reconfigurable systems are everywhere nowadays. The common feature of such systems is the possibility to form dynamic logical connections between the individ...

متن کامل

On the Complexity of Verifying Concurrent Transition Systems

In implementation verification, we check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models the program’s implementation correlate with the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We ...

متن کامل

Verifying Interacting Finite State Machines : Complexity

In this report we carry out a computational complexity analysis of a simple model of concurrency consisting of interacting nite state machines with fairness constraints (IFSMs). This model is based on spec-iication languages used for system speciication by actual formal verii-cation tools, and it allows compact representation of complex systems. We categorize the complexity of two problems aris...

متن کامل

Transaction Management Issues in Web Service-oriented Electronic Commerce Systems: Performance Evaluation

The use of service-oriented technologies has been used increasingly to speed up the application process and respond to changing business needs for many e-commerce systems. However, current e-commerce transaction services are poor at processing data access conflicts in a timely manner. The different timely data access for e-commerce applications should be considered with concurrency control mech...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993